Efficient CTL model-checking for pushdown systems
نویسندگان
چکیده
منابع مشابه
Efficient CTL Model-Checking for Pushdown Systems
Pushdown systems (PDS) are well adapted to model sequential programs with (possibly recursive) procedure calls. Therefore, it is important to have efficient model checking algorithms for PDSs. We consider in this paper CTL model checking for PDSs. We consider the “standard” CTL model checking problem where whether a configuration of a PDS satisfies an atomic proposition or not depends only on t...
متن کاملModel Checking CTL Properties of Pushdown Systems
A pushdown system is a graph G(P ) of configurations of a pushdown automaton P . The model checking problem for a logic L is: given a pushdown automaton P and a formula α ∈ L decide if α holds in the vertex of G(P ) which is the initial configuration of P . Computation Tree Logic (CTL) and its fragment EF are considered. The model checking problems for CTL and EF are shown to be EXPTIME-complet...
متن کاملModel checking pushdown systems
The thesis investigates an approach to automated software verification based on pushdown systems. Pushdown systems are, roughly speaking, transition systems whose states include a stack of unbounded length; there is a natural correspondence between them and the execution sequences of programs with (possibly recursive) subroutines. The thesis examines modelchecking problems for pushdown systems,...
متن کاملModel Checking Büchi Pushdown Systems
We develop an approach to model checking Linear Temporal Logic (LTL) properties of Büchi Pushdown Systems (BPDS). Such BPDS models are suitable for Hardware/Software (HW/SW) co-verification. Since a BPDS represents the asynchronous transitions between hardware and software, some transition orders are unnecessary to be explored in verification. We design an algorithm to reduce BPDS transition ru...
متن کاملSaturation algorithms for model-checking pushdown systems
Pushdown systems have, over the past 15 years, been popular with the software verification community. Their stack can be used to model the call stack of a first-order recursive program, with the control state holding valuations of the program’s global variables, and stack characters encoding the local variable valuations. As such the control flow of first-order recursive programs (such as C and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.07.001